Online Justification for Tabled Logic Programs
نویسندگان
چکیده
Justification is the process of constructing evidence, in terms of proof, for the truth or falsity of an answer derived by tabled evaluation. The evidence is most easily constructed by post-processing the memo tables created during query evaluation. In this paper we introduce online justification, based on program transformation, to efficiently construct the evidence during query evaluation, while adding little overhead to the evaluation itself. Apart from its efficiency, online justification separates evidence generation from exploration thereby providing flexibility in exploring the evidence either declaratively or procedurally. We present experimental results obtained on examples that construct large evidences which demonstrate the scalability of online justification.
منابع مشابه
Speculative Beats Conservative Justification
Justifying the truth value of a goal resulting from query evaluation of a logic program corresponds to providing evidence, in terms of a proof, for this truth. In an earlier work we introduced the notion of justification [8] and gave an algorithm for justifying tabled logic programs by post-processing the memo tables created during evaluation. A conservatve justifier such as the one described i...
متن کاملInitial Results on Justification for the Tabled Transaction Logic
In this paper, we describe our preliminary justification techniques for the transactional queries executed in the tabled Horn Transaction Logic. Transaction Logic is an extension of classical logic programming with state updates similar to database transactions suitable for tasks ranging from processing complex event workflows to AI planning. Execution with tabling is a technique to cache the c...
متن کاملAbductive Logic Programming with Tabled Abduction
In abductive logic programming, abductive solutions are typically computed without attending to the abductive context. These abductive solutions can actually be reused in a different abductive context. In this paper, we employ a tabling mechanism and propose a tabled abduction mechanism, that consists of a transformation from abductive normal logic programs into tabled dual programs, by tabling...
متن کاملPractical Tabled Abduction in Logic Programs
Abduction has by now been employed in various applications using logic programming. But abduction can be costly to perform, if abductive solutions are not tabled, and their reuse allowed even in distinct contexts. Current Prologlike systems, with their tabling mechanisms, are mature enough to facilitate the introduction of tabled abduction into them. This poses a problem of how to actually reus...
متن کاملPreserving Termination of Tabled Logic Programs While Unfolding
We provide a rst investigation of the specialisation and transformation of tabled logic programs through unfolding. We show that | surprisingly | unfolding, even determinate, can worsen the termination behaviour in the context of tabling. We therefore establish two criteria which ensure that such mishaps are avoided. We also brie y discuss the in uence of some other transformation techniques on...
متن کامل